Formalisms for mobile resource control

Failing to control resources in mobile, concurrent and distributed systems may lead to important breakdowns or Denial of Service-like attacks. In order to address this problem, we present enhanced versions of several calculi for mobile and distributed computing, namely NBA, Seals, Nomadic π and Kells. In each case, we make the formalism resource-conscious and define a type system in order to guarantee statically compliance with resource control policies. Comparing the solutions we proposed for these calculi, we try and define the necessities of resource-control in mobile and distributed formalisms.